On self-clique graphs with triangular cliques
نویسندگان
چکیده
منابع مشابه
On self-clique graphs with triangular cliques
Abstract. A graph is an {r, s}-graph if the set of degrees of their vertices is {r, s}. A clique of a graph is a maximal complete subgraph. The clique graph K(G) of a graph G is the intersection graph of all its cliques. A graph G is self-clique if G is isomorphic to K(G). We show the existence of self-clique {5, 6}-graphs whose cliques are all triangles, thus solving a problem posed by Chia an...
متن کاملOn hereditary clique-Helly self-clique graphs
A graph is clique-Helly if any family of mutually intersecting (maximal) cliques has non-empty intersection, and it is hereditary clique-Helly (abbreviated HCH) if its induced subgraphs are clique-Helly. The clique graph of a graph G is the intersection graph of its cliques, and G is self-clique if it is connected and isomorphic to its clique graph. We show that every HCH graph is an induced su...
متن کاملSelf-clique Graphs with Prescribed Clique-sizes
The clique graph of a graph G is the intersection graph K(G) of the (maximal) cliques of G. A graph G is called self-clique whenever G ∼= K(G). This paper gives various constructions of self-clique graphs. In particular, we employ (r, g)-cages to construct self-clique graphs whose set of clique-sizes is any given finite set of integers greater than 1.
متن کاملComputational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs
During the last decade, many problems in social, biological, and financial networks require finding cliques, or quasi-cliques. Cliques or clique partitions have also been used as clustering or classification tools in data sets represented by networks. These networks can be very large and often massive and therefore external (or semi-external) memory algorithms are needed. We discuss four applic...
متن کاملCounting cliques and clique covers in random graphs
We study the problem of counting the number of isomorphic copies of a given template graph, say H , in the input base graph, say G. In general, this is (provably) very hard to solve efficiently. So, a lot of work has gone into designing efficient approximation schemes, especially, when H is a perfect matching. In this work, we present schemes to count k-cliques and k-clique covers. Our embeddin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.08.018